N-best softmax smoothing for minimum bayes risk training of attention based sequence-to-sequence models

ABSTRACT

A method and apparatus are provided that analyzing sequence-to-sequence data, such as sequence-to-sequence speech data or sequence-to-sequence machine translation data for example, by minimum Bayes risk (MBR) training a sequence-to-sequence model and within introduction of applications of softmax smoothing to an N-best generation of the MBR training of the sequence-to-sequence model.

CROSS REFERENCE

This application is a continuation of U.S. application Ser. No. 16/191,027, filed Nov. 14, 2018, the disclosure of which is incorporated by reference herein in its entirety.

BACKGROUND 1. Field

The disclosed subject matter relates to training and output with respect to attention based sequence-to-sequence models in end-to-end recognition systems, such as speech recognition and machine translation.

2. Description of Related Art

Speech recognition and machine translation involving Minimum Bayes risk (MBR), a training criteria, training commonly make over-confident predictions. For example, attention based sequence-to-sequence models may be applied to neural machine translation, and MBR training of attention based sequence-to-sequence models may result in label predictions conditioned on acoustic inputs and previously emitted labels. However, use of lattices as a hypothesis set in such models and training presents the technical problem of practically complicating the forward computation procedure of the MBR training. An N-best consideration obtained by a beam-search may technically improve such problems as efficient and effective for MBR training.

However, even so, such an attention based sequence-to-sequence model may tend to make over-confident predictions which results in other technical problems. For example, when using a beam search during MBR training, the resulting over-confident predictions may lead to too many alike hypothesized sequences among resulting N-best outputs and thereby prevent the MBR training procedures from obtaining desired diversity in its hypothesis space. Therefore, even with using beam searching there still remains technical problems regarding the N-best outputs in that practically too many alike hypothesized sequences may result from over-confident predictions.

Therefore, performance in MBR trained and attention based sequence-to-sequence models may be improved by solving technical problems resulting from over-confident predictions involved in attention based sequence-to-sequence models.

SUMMARY

In view of previous attempts at improving performance in MBR trained and attention based sequence-to-sequence models, where such attempts undesirably led to overconfident predictions and inadequately diverse hypothesis spaces, the disclosed subject matter herein describes achieving such improved performance. Exemplary embodiments introduce softmax smoothing into N-best generation during MBR training and thereby combat issues of over-confident predictions of such attention based sequence-to-sequence models and may be applied to various sequence-to-sequence tasks such as speech recognition and machine learning.

According to exemplary embodiments, there is an apparatus and a method in which there is at least one memory configured to store computer program code and at least one hardware processor configured to access said computer program code and operate as instructed by said computer program code including minimum Bayes risk (MBR) training code configured to cause said at least one hardware processor to train a sequence-to-sequence mode and smoothing code configured to cause said at least one hardware processor to apply softmax smoothing to an N-best generation of the MBR training.

According to exemplary embodiments, the apparatus and method further include beam search code configured to cause said at least one hardware processor to perform a beam search during the MBR training.

According to exemplary embodiments, the apparatus and method further include beam search code further configured to during each step or iteration of the beam search, apply the softmax smoothing to a label prediction distribution.

According to exemplary embodiments, the apparatus and method further comprises obtaining code configured to cause said at least one processor to obtain, as a result of applying the softmax smoothing, a plurality of hypothesized outputs applied to a hypothesis space for the MBR training.

According to exemplary embodiments, the apparatus and method further, for the MBR training code is configured to cause said at least one processor to apply an MBR loss operation to a plurality of pairs of training data and corresponding reference label sequences.

According to exemplary embodiments, the apparatus and method further include training data that comprises training speech utterance data.

According to exemplary embodiments, the apparatus and method further include training data that comprises training machine translation data.

According to exemplary embodiments, the apparatus and method further include an MBR loss operation that comprises a risk operation between a hypothesized label sequence and ones of the reference label sequences.

According to exemplary embodiments, the apparatus and method further include an MBR loss operation that comprises a sequence probability given the training data.

According to exemplary embodiments, the apparatus and method further derive gradients of the MBR loss operation with respect to a probability, of the sequence-to-sequence model emitting a particular label of the label prediction distribution, and the risk operation.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of a simplified block diagram of a system in accordance with an embodiment.

FIG. 2 is a schematic illustration of a simplified flow chart of a communication system in accordance with an embodiment.

FIG. 3 is a schematic illustration of a simplified flow chart of a communication system in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a system in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified flow chart of a communication system in accordance with an embodiment.

DETAILED DESCRIPTION

FIG. 1 is an illustration of a simplified block diagram of a system 100 in accordance with an embodiment.

There is a terminal apparatus 103 which includes connections to a database 102 and a network 104, which may be any of an intranet or the internet, and includes any of various hardware described further with respect to FIG. 4 such as at least one hardware processor, a memory and a decoder for example. The terminal apparatus 103 is configured to implement MBR training for attention based sequence-to-sequence models by referring to any of data 101 from the database 102, from the network 104 or otherwise input to the terminal apparatus as described further with respect to FIGS. 2 and 3 .

The database 102 may be included in the terminal apparatus 103, and the terminal apparatus 103 may also transmit control to the network 104 to implement MBR training for attention based sequence-to-sequence models.

FIG. 2 illustrates a flowchart 200 regarding MBR training for attention based sequence-to-sequence models.

At S201, training data is received, such as at the terminal apparatus 103, by which to perform MBR training.

At S202, an MBR function or operation, such as an MBR loss function with use of the below-described risk function and sequence probability, is applied as, for example:

$\begin{matrix} {{{L_{MBR}\left( {x_{1:U},y_{1:U}^{r}} \right)} = {\sum\limits_{u = 1}^{U}{\sum\limits_{y_{u}}\frac{{P\left( {y_{u}❘x_{u}} \right)}{R\left( {y_{u},y_{u}^{r}} \right)}}{\sum\limits_{y_{u}^{\prime}}{P\left( {y_{u}^{\prime}❘x_{u}} \right)}}}}},} & (1) \end{matrix}$

For that function, consider that y denotes an output sequence from the sequence-to-sequence model: y=y₁, y₂, y_(i), . . . y_(L) and is given U pairs of the training speech utterance x and its corresponding reference label sequence y^(r).

Further, y_(u) represents one of hypothesized output label sequences and corresponds to the x_(u). R(y_(u)y_(u) ^(r)) is the risk function between a hypothesized and reference label sequence, e.g., edit-distance. P(y_(u)|x_(u)) is the sequence probability given input x_(u).

According to the chain rule:

$\begin{matrix} {{P\left( {y_{u}❘x_{u}} \right)} = {{P\left( {y_{1},y_{2},y_{i},\ldots,{y_{L}❘x_{u}}} \right)} = {{{p\left( {y_{1}❘x_{u}} \right)}{p\left( {{y_{2}❘y_{1}},x_{u}} \right)}\ldots{p\left( {{y_{L}❘y_{{1:L} - 1}},x_{u}} \right)}} = {\overset{L}{\prod\limits_{i = 1}}{{p\left( {{y_{i}❘y_{{1:i} - 1}},x_{u}} \right)}.}}}}} & (2) \end{matrix}$

At S203, gradients of outputs of that function from S202 may be derived. For example, note that p(y_(i)|y_(1:i-1), x_(u)) is exactly the output of sequence-to-sequence model. Therefore, to perform MBR training of a sequence-to-sequence model, exemplary embodiments derive the gradients of MBR loss function with respect to p(y_(i)|y_(1:i-1), x_(u)).

At S204, it is considered whether further gradient outputs from S203 are pending and if not, proceeds to S205 at which a hypothesis set may be defined as follows. For convenience, it may be considered in defining such hypothesis set where p(y_(i)=y) is shorthand for p(y_(i)=y|y_(1:i-1), x_(u)), i.e., the probability of the model emitting a particular label y at the step i, f(y_(u)) and g(y_(u)) are short-hands for P(y_(u)|x_(u)) and R(y_(u),y_(u) ^(r)) in Eq.(1).

Accordingly, we define a hypothesis set S={y_(u)|y_(i)=y} which contains all the hypothesized sequences whose ith label is y in S205.

At S206, that hypothesis may be divided. For example, all hypothesized sequences may be divided into two disjoint sets, y_(u)∈S and y_(u)∉S, and the MBR loss function may be rewritten as:

$\begin{matrix} {L_{MBR} = {\sum\limits_{u = 1}^{U}{\frac{{\sum\limits_{y_{u} \in S}{{f\left( y_{u} \right)}{g\left( y_{u} \right)}}} + {\sum\limits_{y_{u} \notin S}{{f\left( y_{u} \right)}{g\left( y_{u} \right)}}}}{{\sum\limits_{y_{u}^{\prime} \in S}{f\left( y_{u}^{\prime} \right)}} + {\sum\limits_{y_{u}^{\prime} \notin S}{f\left( y_{u}^{\prime} \right)}}}.}}} & (3) \end{matrix}$ ∂∑f(y_(u))

At S207, there is notice of

$\frac{y_{u} \notin S}{\partial{p\left( {y_{i} = y} \right)}} = 0$

by which a derivative of MBR loss function with respect to:

$\begin{matrix} {{\log{p\left( {y_{i} = y} \right)}},{\frac{\partial L_{MBR}}{{\partial\log}{p\left( {y_{i} = y} \right)}} = {{\sum\limits_{u = 1}^{U}{\frac{\partial L_{MBR}}{\partial{p\left( {y_{i} = y} \right)}} \cdot \frac{\partial{p\left( {y_{i} = y} \right)}}{{\partial\log}{p\left( {y_{i} = y} \right)}}}} = {{\sum\limits_{u = 1}^{U}{\frac{\partial L_{MBR}}{\partial{p\left( {y_{i} = y} \right)}} \cdot {p\left( {y_{i} = y} \right)}}} = {{\sum\limits_{u = 1}^{U}\left( {\frac{\sum\limits_{y_{u} \in S}{{f\left( y_{u} \right)}{g\left( y_{u} \right)}}}{\sum\limits_{y_{u}^{\prime}}{f\left( y_{u}^{\prime} \right)}} - \frac{\sum\limits_{y_{u}}{{f\left( y_{u} \right)}{g\left( y_{u} \right)}{\sum\limits_{y_{u} \in S}{f\left( y_{u} \right)}}}}{\left\lbrack {\sum\limits_{y_{u}^{\prime}}{f\left( y_{u}^{\prime} \right)}} \right\rbrack^{2}}} \right)} = {\sum\limits_{u = 1}^{U}{\sum\limits_{y_{u} \in S}{{\gamma\left( y_{u} \right)}\left( {{g\left( y_{u} \right)} - {\overset{\_}{R}}_{u}} \right)}}}}}}},} & (4) \end{matrix}$

Further from Eq. (4), it is considered that γ(y_(u)) is the normalized sequence probability, i.e.

${\gamma\left( y_{u} \right)} = {\frac{f\left( y_{u} \right)}{\sum\limits_{y_{u}^{\prime}}{f\left( y_{u}^{\prime} \right)}} = {\frac{P\left( {y_{u}❘x_{u}} \right)}{\sum\limits_{y_{u}^{\prime}}{P\left( {y_{u}^{\prime}❘x_{u}} \right)}}.}}$

At S208, an averaged risk from S207 may be taken. For example, R _(u) may be taken as an averaged risk among all the hypothesized sequences for the training utterance u,

$\begin{matrix} {{\overset{\_}{R}}_{u} = {\frac{\sum\limits_{y_{u}}{{f\left( y_{u} \right)}{g\left( y_{u} \right)}}}{\sum\limits_{y_{u}^{\prime}}{f\left( y_{u}^{\prime} \right)}} = {\sum\limits_{y_{u}}{{\gamma\left( y_{u} \right)}{{R\left( {y_{u},y_{u}^{r}} \right)}.}}}}} & (5) \end{matrix}$

And at S209, an N-best set consideration may occur at which an N-best set for MBR training is obtained by re-scoring the hypothesis set according to:

$\begin{matrix} {{{score}\left( {y,x} \right)} = {\log{P\left( {y❘x} \right)}/{\left( \frac{\left( {5 + {❘y❘}} \right)^{\alpha}}{\left( {5 + 1} \right)^{\alpha}} \right).}}} & (6) \end{matrix}$

The N-best set of S209 is described further with respect to FIG. 3 , and according to exemplary embodiments represents a top N best hypothesized outputs from some recognizer, such as a speech recognizer, and may be used for a hypothesis space for MBR training or other discriminative training.

FIG. 3 illustrates a flowchart 300 regarding N-best generation for MBR training.

At S301, an output, such as O^(dec) output from a decoder of an attention based sequence-to-sequence model, is obtained.

At S302, a step of a beam search occurs, and at S303, the method introduces softmax smoothing into N-best generation for MBR training. Specifically, when searching for N-best during MBR training, β is used to smooth the label prediction distribution and generate the scores at each step of beam-search as,

p(y _(i) |y _(1:i-1) ,x)=softmax(βO ^(dec)),β<1,  (7)

Beam searching is a method which may be built on an encoder-decoder system and may approximate searches to obtain results from various candidates, such as from a search tree based on costs of searching, for example.

At S303, it is considered whether the beam search, with such added smoothing in S303, is completed and if so, at S305, an N-best set is obtained.

According to exemplary embodiments, such method is compared against MBR training without N-best softmax smoothing on two most widely used benchmarks for English conversational speech recognition, Switchboard—300 hrs and Switchboard+Fisher—2000 hrs. For both methods, the following configurations are used for comparisons:

-   -   (1) 40-dimensional log-mel filterbanks, the central frame is         spliced with left 5 plus right 3 frames are taken.     -   (2) Targets are a set of 49 characters which contains English         letters, numbers, punctuations, special transcribed notations in         Switchboard include ‘[laughter]’, ‘[noise]’, ‘[vocalized-noise]’         plus ‘(space)’, ‘(SOS)’, ‘(EOS)’ which are used as the         indicators for the word boundary, start and end of the sequence.     -   (3) 6-layer stacked bidirectional and two-layer unidirectional         LSTMs are used for the encoder and decoder, both with 512 hidden         units. MLP based attention module is adopted in the experiments.         MLP is a multi-layer perceptron which is a class of feedforward         artificial network. LSTMs are long short-term memory units and         are a kind of recurrent neural network.     -   (4) Adam optimization algorithm is used for all experiments         where β₁=0.9, β₂=0.999, ε=10⁻⁸ And the learning rate is set to         3×10⁻⁶.     -   (5) The performances are evaluated on three standard test set,         Eval2000-Switchboard, Eval2000-Callhome and Eval2000.

Experimental results are shown in Table 1 and Table 2 which demonstrate that by the MBR training with N-best softmax smoothing, as compared to without, the performances of speech recognition are consistently better.

In the below table, “E′ER” refers to word error rate as a performance metric recognition system where a lower rate is more preferable.

TABLE 1 Experimental Results on Switchboard-300 hrs benchmark WERs(%) Methods Eval2000-Switchboard Eval2000 MBR 12.5 18.3 MBR + 

 , 

 smoothing 12.2 17.8

TABLE 2 Experimental Results on Switchboard + Fisher-2000 hrs benchmark WERs(%) Methods Eval2000-Switchboard Eval2000-Callhome MBR 8.3 16.1 MBR + 

 , 

 smoothing 8.3 15.5

According to exemplary embodiments, such MBR training, may be used for any variations of attention based sequence-to-sequence models, such as machine translation and end-to-end speech recognition.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media or by a specifically configured one or more hardware processors. For example, FIG. 4 shows a computer system 400 suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 4 for computer system 400 are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system 400.

Computer system 400 may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard 401, mouse 402, trackpad 403, touch screen 410, joystick 405, microphone 406, scanner 407, camera 408.

Computer system 400 may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen 410, or joystick 405, but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers 409, headphones (not depicted)), visual output devices (such as screens 410 to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability— some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system 400 can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW 420 with CD/DVD or the like media 421, thumb-drive 422, removable hard drive or solid state drive 423, legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system 400 can also include interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general-purpose data ports or peripheral buses (449) (such as, for example USB ports of the computer system 400; others are commonly integrated into the core of the computer system 400 by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system 400 can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbusto certain CANbus devices), or bidirectional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core 440 of the computer system 400.

The core 440 can include one or more Central Processing Units (CPU) 441, Graphics Processing Units (GPU) 442, specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) 443, hardware accelerators for certain tasks 444, and so forth. These devices, along with Read-only memory (ROM) 145, Random-access memory 446, internal mass storage such as internal non-user accessible hard drives, SSDs, and the like 447, may be connected through a system bus 448. In some computer systems, the system bus 448 can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus 448, or through a peripheral bus 449. Architectures for a peripheral bus include PCI, USB, and the like.

CPUs 441, GPUs 442, FPGAs 443, and accelerators 444 can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM 445 or RAM 446. Transitional data can be also be stored in RAM 446, whereas permanent data can be stored for example, in the internal mass storage 447. Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU 441, GPU 442, mass storage 447, ROM 445, RAM 446, and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture 400, and specifically the core 440 can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core 440 that are of non-transitory nature, such as core-internal mass storage 447 or ROM 445. The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core 440. A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core 740 and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM 446 and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator 444), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

FIG. 5 illustrates a flowchart 500 simplified regarding use of such improved MBR training attention bases sequence-to-sequence model.

For example at S501, some sequence, machine translation or audio/speech input, may be obtained.

At S502, analysis with the N-best set, such as described with respect to FIGS. 2 and 3 , may convert the input sequence to an output sequence, and such of such N-best set would avoid the above-described issues of over-confident predictions of such attention based sequence-to-sequence models.

At S503, a converted to sequence may be output by which a user, such as at the user terminal 103, may view or listen to such converted sequence.

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof. 

What is claimed is:
 1. An apparatus comprising: at least one memory configured to store computer program code; at least one hardware processor configured to access said computer program code and operate as instructed by said computer program code, said computer program code including: training code configured to cause said at least one hardware processor to train a sequence-to-sequence model; and smoothing code configured to cause said at least one hardware processor to, during an N-best generation of the training, apply softmax smoothing to a label prediction distribution and generate scores at steps of a beam-search of the N-best generation of the training.
 2. The apparatus according to claim 1, wherein the computer program code further includes beam search code configured to cause said at least one hardware processor to perform the beam search during the training.
 3. The apparatus according to claim 2, wherein the beam search code is further configured to, during each iteration of the beam search, apply the softmax smoothing to the label prediction distribution.
 4. The apparatus according to claim 3, wherein the computer program code further comprises obtaining code configured to cause said at least one processor to obtain hypothesized outputs applied to a hypothesis space for the training.
 5. The apparatus according to claim 1, wherein the training code is configured to cause said at least one processor to apply a loss operation to the training data and corresponding reference label sequences.
 6. The apparatus according to claim 5, wherein the training data comprises speech data.
 7. The apparatus according to claim 5, wherein the training data comprises machine translation data.
 8. The apparatus according to claim 5, wherein the loss operation comprises a risk operation between a hypothesized label sequence and the reference label sequences.
 9. The apparatus according to claim 5, wherein the loss operation comprises a sequence probability given the training data.
 10. The apparatus according to claim 8, wherein the training further comprises deriving a gradient of the loss operation with respect to a probability, regarding a particular label of the label prediction distribution, and the risk operation.
 11. A method performed by at least one computer processor comprising: training a sequence-to-sequence model; and during an N-best generation of the training, applying softmax smoothing to a label prediction distribution and generating scores at steps of a beam search of the N-best generation of the training.
 12. The method according to claim 11, further comprising: performing the beam search during the training.
 13. The method according to claim 12, further comprising: during each step of the beam search, applying the softmax smoothing to the label prediction distribution.
 14. The method according to claim 13, further comprising: obtaining hypothesized outputs applied to a hypothesis space for the training.
 15. The method according to claim 11, wherein the training comprises applying a loss operation to the training data and corresponding reference label sequences.
 16. The method according to claim 15, wherein the training data comprises speech data.
 17. The method according to claim 15, wherein the training data comprises machine translation data.
 18. The method according to claim 15, wherein the loss operation comprises a risk operation between a hypothesized label sequence and the reference label sequences.
 19. The method according to claim 15, wherein the loss operation comprises a sequence probability given the training data.
 20. A non-transitory computer readable medium storing a program causing a computer to execute a process, the process comprising: training a sequence-to-sequence model; and during an N-best generation of the training, applying softmax smoothing to label prediction distribution and generating scores at steps of a beam-search of the N-best generation of the training. 